Generating permutations with restricted containers
نویسندگان
چکیده
منابع مشابه
Finitely labeled generating trees and restricted permutations
Generating trees are a useful technique in the enumeration of various combinatorial objects, particularly restricted permutations. Quite often, the generating tree for the set of permutations avoiding a set of restrictions Q requires infinitely many labels. Sometimes, however, this generating tree needs only finitely many labels. We characterize the finite sets of restrictions Q for which this ...
متن کاملPermutations with Restricted Position
6. Concluding Remarks. Preliminary analysis indicates that parallel computation, using modular arithmetic, is feasible for certain kinds of problems. The parallel computation envisioned here leads very swiftly to a solution encoded "in modular notation." By this is meant, a system of simultaneous congruences, whose solution (in a specified interval), written as a binary number, has as its initi...
متن کاملGenerating restricted classes of involutions, Bell and Stirling permutations
We present a recursive generating algorithm for unrestricted permutations which is based on both the decomposition of a permutation as a product of transpositions and that as a union of disjoint cycles. It generates permutations at each recursive step and slight modifications of it produce generating algorithms for Bell permutations and involutions. Further refinements yield algorithms for thes...
متن کاملRestricted permutations
Restricted permutations are those constrained by having to avoid subsequences ordered in various prescribed ways. They have functioned as a convenient descriptor for several sets of permutations which arise naturally in combinatorics and computer science. We study the partial order on permutations (and more general sequences) that underlies the idea of restriction and which gives rise to sets o...
متن کاملGenerating Permutations with k-Differences
Given (n; k) with n k 2 and k 6 = 3, we show how to generate all permutations of n objects (each exactly once) so that successive permutations diier in exactly k positions, as do the rst and last permutations. This solution generalizes known results for the speciic cases where k = 2 and k = n. When k = 3, we show that it is possible to generate all even (odd) permutations of n objects so that s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2018
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2018.02.006